Practical Encrypted Network Traffic Pattern Matching for Secure Middleboxes

نویسندگان

چکیده

Network Function Virtualisation (NFV) advances the adoption of composable software middleboxes. Accordingly, cloud data centres become major NFV vendors for enterprise traffic processing. Due to privacy concern redirection cloud, secure middlebox systems (e.g., BlindBox) draw much attention; they can process encrypted packets against rules directly. However, most existing supporting pattern matching based network functions require gateway tokenise packet payloads via sliding windows. Such tokenisation induces a considerable communication overhead, which be over 100$\times$ size. To overcome this bottleneck, in paper, we propose first bandwidth-efficient protocol We resort primitive called symmetric hidden vector encryption (SHVE), and variant it, aka SHVE+, achieve constant moderate cost. speed up, devise filters reduce number accesses SHVE+ during highly. formalise security our proposed conduct comprehensive evaluations real-world rulesets dumps. The results show that design inspect 20k within 100 $\mu$s. Compared prior work, it brings saving $94\%$ bandwidth consumption.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pattern Matching on Encrypted Streams

Pattern matching is essential in applications such as deep-packet inspection (DPI), searching on genomic data, or analyzing medical data. A simple task to do on plaintext data, pattern matching is much harder to do when the privacy of the data must be preserved. Existent solutions involve searchable encryption mechanisms with at least one of these three drawbacks: requiring an exhaustive (and s...

متن کامل

5PM: Secure Pattern Matching

In this paper we consider the problem of secure pattern matching that allows singlecharacter wildcards and substring matching in the malicious (stand-alone) setting. Our protocol, called 5PM, is executed between two parties: Server, holding a text of length n, and Client, holding a pattern of length m to be matched against the text, where our notion of matching is more general and includes non-...

متن کامل

Practical Pattern Matching

No new genes? At the University of Toronto, Brendan Frey is leading a group of scientists who are using AI techniques to analyze molecularbiology data. One of their projects involves using a factor graph they developed called GenRate to discover and evaluate genes in mouse tissues. Factor graphs let researchers describe a system with complex variables, such as gene location in DNA as well as ge...

متن کامل

Toward Practical Secure Stable Matching

The Stable Matching (SM) algorithm has been deployed in many real-world scenarios including the National Residency Matching Program (NRMP) and financial applications such as matching of suppliers and consumers in capital markets. Since these applications typically involve highly sensitive information such as the underlying preference lists, their current implementations rely on trusted third pa...

متن کامل

Secure and Practical Computation on Encrypted Data by Muhammad Naveed

Because of the importance of computing on data with privacy protections, the cryptographic community has developed both theoretical and practical solutions to compute on encrypted data. On the one hand, theoretical schemes, such as fully homomorphic encryption and functional encryption, are secure but extremely inefficient. On the other hand, practical schemes, such as property-preserving encry...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Dependable and Secure Computing

سال: 2022

ISSN: ['1941-0018', '1545-5971', '2160-9209']

DOI: https://doi.org/10.1109/tdsc.2021.3065652